- lattice completion
- Техника: пополнение структур
Универсальный англо-русский словарь. Академик.ру. 2011.
lattice completion
Смотреть что такое "lattice completion" в других словарях:
Dedekind–MacNeille completion — The Hasse diagram of a partially ordered set (left) and its Dedekind–MacNeille completion (right). In order theoretic mathematics, the Dedekind–MacNeille completion of a partially ordered set (also called the completion by cuts or normal… … Wikipedia
Complete lattice — In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). Complete lattices appear in many applications in mathematics and computer science. Being a special instance of… … Wikipedia
Multipurpose Applied Physics Lattice Experiment — For other senses of maple , see Maple (disambiguation). The Multipurpose Applied Physics Lattice Experiment (MAPLE) dedicated isotope production facility was a project jointly undertaken by AECL and MDS Nordion. It was intended to include two… … Wikipedia
Completeness (order theory) — In the mathematical area of order theory, completeness properties assert the existence of certain infima or suprema of a given partially ordered set (poset). A special use of the term refers to complete partial orders or complete lattices.… … Wikipedia
Engineering Projects — ▪ 1995 Introduction BRIDGES Notable Engineering Projects(For Notable Engineering Projects in work, see Table (Notable Engineering Projects).) As the decade of the 1990s reached its midpoint, the limits to bridge design were being… … Universalium
Battle class destroyer — The Battle class were a class of destroyers of the British Royal Navy (RN) and Royal Australian Navy (RAN). Built in three groups, the first group were ordered under the 1942 naval estimates. A modified second and third group, together with two… … Wikipedia
Glossary of order theory — This is a glossary of some terms used in various branches of mathematics that are related to the fields of order, lattice, and domain theory. Note that there is a structured list of order topics available as well. Other helpful resources might be … Wikipedia
Formal concept analysis — is a principled way of automatically deriving an ontology from a collection of objects and their properties. The term was introduced by Rudolf Wille in 1984, and builds on applied lattice and order theory that was developed by Birkhoff and others … Wikipedia
Ideal (order theory) — In mathematical order theory, an ideal is a special subset of a partially ordered set (poset). Although this term historically was derived from the notion of a ring ideal of abstract algebra, it has subsequently been generalized to a different… … Wikipedia
Dedekind cut — Dedekind used his cut to construct the irrational, real numbers. In mathematics, a Dedekind cut, named after Richard Dedekind, is a partition of the rationals into two non empty parts A and B, such that all elements of A are less than all… … Wikipedia
Completeness — In general, an object is complete if nothing needs to be added to it. This notion is made more specific in various fields. Contents 1 Logical completeness 2 Mathematical completeness 3 Computing 4 … Wikipedia
